Translating I 0+exp proofs into weaker systems

نویسنده

  • Chris Pollett
چکیده

The purpose of this paper is to explore the relationship between I∆0+exp and its weaker subtheories. We give a method of translating certain classes of I∆0+exp proofs into weaker systems of arithmetic such as Buss’ systems S2. We show if IEi(exp) ` A with a proof P of expindrank(P ) ≤ n + 1 where all (∀ ≤: right) or (∃ ≤: left) have bounding terms not containing function symbols then Si 2 ⊇ IEi,2 ` An. Here A is not necessarily a bounded formula. For IOpen(exp) we prove a similar result. Using our translations we show IOpen(exp) ( I∆0(exp). Here I∆0(exp) is a conservative extension of I∆0+exp obtained by adding to I∆0 a symbol for 2x to the language as well as defining axioms for it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Proof Systems for Propositional Logic and Complete Sets

A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called a proof system. Cook and Reckhow deened this concept in 6] and in order to compare the relative strength of diierent proof systems, they considered the notion of p-simulation. Intuitively a proof system h p-simulates a second one h 0 if there is a polynomial time computabl...

متن کامل

Theories and Proof Systems for PSPACE and the EXP - Time Hierarchy

Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy Alan Ramsay Skelley Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 This dissertation concerns theories of bounded arithmetic and propositional proof systems associated with PSPACE and classes from the exponential-time hierarchy. The second-order viewpoint of Zambella and Cook associates sec...

متن کامل

Translating Set Theoretical Proofs into Type Theoretical Programs

We show how to translate proofs of 0 2-sentences in the fragment of set theory KPI + U , which is an extension of Kripke-Platek set theory, into proofs of Martin-LL of's Type Theory using a cut elimination argument. This procedure is eeective. The method used is an implementation of techniques from traditional proof theoretic analysis in type theory. It follows that KPI + U and ML1W show the sa...

متن کامل

P-129: Study of GnRH Potential in Inhibition of Side Effect of Drugs Used in Chemotherapy on Spermatogenesis

Background: Male factors, mainly spermatogenesis disorder, are responsible for 20-30% of infertility occurs in different societies. One of the known causes of spermatogenesis disorder is chemotherapy in patients with cancer. The side effect of chemotherapic agents may last from 10 years up to the end of the life. Since dividing cells are mainly affected by anticancer drugs, the aim of the prese...

متن کامل

An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle

We prove lower bounds of the form exp (n " d) ; " d > 0; on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d; for any constant d: This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999